منابع مشابه
Linear Scheduling is Nearly
This paper deals with the problem of nding optimal schedulings for uniform dependence algorithms. Given a convex domain, let T f be the total time needed to execute all computations using the free (greedy) schedule and let T l be the total time needed to execute all computations using the optimal linear schedule. Our main result is to bound T l =T f and T l ?T f for suuciently \fat" domains.
متن کاملNearly Sparse Linear Algebra
In this article, we propose a method to perform linear algebra on a matrix with nearly sparse properties. More precisely, although we require the main part of the matrix to be sparse, we allow some dense columns with possibly large coefficients. We modify Block Wiedemann algorithm and show that the contribution of these heavy columns can be made negligible compared to the one of the sparse part...
متن کاملNearly Linear Time
The notion of linear-time computability is very sensitive to machine model. In this connection, we introduce a class NLT of functions computable in nearly linear time n(log n)O(1) on random access computers. NLT is very robust and does not depend on the particular choice of random access computers. Kolmogorov machines, Schonhage machines, random access Turing machines, etc. also compute exactl...
متن کاملOn Nearly Linear Recurrence Sequences
A nearly linear recurrence sequence (nlrs) is a complex sequence (an) with the property that there exist complex numbers A0,. . ., Ad−1 such that the sequence ( an+d + Ad−1an+d−1 + · · · + A0an )∞ n=0 is bounded. We give an asymptotic Binet-type formula for such sequences. We compare (an) with a natural linear recurrence sequence (lrs) (ãn) associated with it and prove under certain assumptions...
متن کاملNearly hyperharmonic functions and Jensen measures
Let (X,H) be a P-harmonic space and assume for simplicity that constants are harmonic. Given a numerical function φ on X which is locally lower bounded, let Jφ(x) := sup{ ∫ ∗ φdμ(x) : μ ∈ Jx(X)}, x ∈ X, where Jx(X) denotes the set of all Jensen measures μ for x, that is, μ is a compactly supported measure on X satisfying ∫ u dμ ≤ u(x) for every hyperharmonic function on X. The main purpose of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2019
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2019.08.001